package com.chj.chuji.tijie03;

import java.util.Arrays;

public class NumTet {
	public static void main(String[] args) {
//		Scanner sc = new Scanner(System.in);
//		while (sc.hasNext()) {
//			int n = sc.nextInt();
//			int[] nums = new int[n];
//			for (int i = 0; i < n; i++) {
//				nums[i] = sc.nextInt();
//			}
//			int flag = sc.nextInt();

		int n = 8;
		int[] nums = new int[] { 1, 2, 4, 9, 3, 55, 64, 25 };
		int flag = 0;
		Arrays.sort(nums);
		if (flag == 1) {
			for (int i = n - 1; i >= 1; i--) {
				System.out.printf("%d ", nums[i]);
			}
			System.out.println(nums[0]);

		} else {
			for (int i = 0; i < n - 1; i++) {
				System.out.printf("%d ", nums[i]);
			}
			System.out.println(nums[n - 1]);
		}

	}
//	}
}
